|
In mathematics, it can be shown that every function can be written as the composite of a surjective function followed by an injective function. Factorization systems are a generalization of this situation in category theory. ==Definition== A factorization system (''E'', ''M'') for a category C consists of two classes of morphisms ''E'' and ''M'' of C such that: #''E'' and ''M'' both contain all isomorphisms of C and are closed under composition. #Every morphism ''f'' of C can be factored as for some morphisms and . #The factorization is ''functorial'': if and are two morphisms such that for some morphisms and , then there exists a unique morphism making the following diagram commute: ''Remark:'' is a morphism from to in the arrow category. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「factorization system」の詳細全文を読む スポンサード リンク
|